A memory efficient array architecture for full-search block matching algorithm
نویسندگان
چکیده
This paper proposes a novel array architecture for full-search block matching motion estimation. The design efforts are focused on transforming the array computation in a way that minimizes the memory and I/O costs while satisfying the highest throughput requirements. Compared with the existing architectures, this one ensures feasible solutions for the HDTV picture format with twice lower memory requirements, minimal I/O pin count and 100% processor utilization. The architecture features regular and simple interconnects and is quite suitable for VLSI implementation.
منابع مشابه
An Efficient VLSI Architecture for Full-Search Block Matching Algorithms
This paper presents a novel memory-based VLSI architecture for full search block matching algorithms. We propose a semi-systolic array to meet the requirements of high computational complexity, where data communications are handled in two styles: (1) global connections for search data and (2) local connections for partial sum. Data flow is handled by a multiple-port memory bank so that all proc...
متن کاملAn efficient and reconfigurable VLSI architecture for different block matching motion estimation algorithms
| This paper describes a VLSI architecture which can be recon gured to support both Full Search Block{Matching algorithm and 3{step Hierarchical Search Block{Matching algorithm. By using a recon gurable register{ mux array and a parameterizable adder tree, the 2{D array architecture provides e cient real time motion estimation for many video applications. We also propose a memory architecture a...
متن کاملFast VLSI Implementation for Low Power Motion Estimation Removing Redundant Memory Data Access
| This paper presents a new VLSI architecture of the Motion Estimation in MPEG-2. Previously , a number of full search block matching algorithms (BMA) and architectures using systolic array have been proposed for motion estimation. However, the architectures have an ineeciently large number of external memory access. Recently, to reduce the number of accesses in one candidate block, a block mat...
متن کاملA New Efficient VLSI Architecture for Full Search Block Matching Motion Estimation
A new efficient type I architecture for motion estimation in video sequences based on the Full-Search Block-Matching (FSBM) algorithm is proposed in this paper. This architecture presents minimum latency, maximum throughput and full utilization of the hardware resources, combining both pipelining and parallel processing techniques. The implementation of an array processor for motion estimation ...
متن کاملSemi-systolic array based motion estimation processor design
This paper presents a new VLSI architecture for full-search block matching algorithm. The proposed architecture has two specific features: (1) it lhas a processor element (PE) array which provides sufficient computational power, where PE's work in a semi-systolic style and (2) it contains stream memory banks which provide scheduled data flow to reduce idle operations within PE array. By exploit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997